Beal’s Conjecture - Counter Examples

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counter-examples to the correlated stability conjecture

We demonstrate explicit counter-examples to the Correlated Stability Conjecture (CSC), which claims that the horizon of a black brane is unstable precisely if that horizon has a thermodynamic instability, meaning that its matrix of susceptibilities has a negative eigenvalue. These examples involve phase transitions near the horizon. Ways to restrict or revise the CSC are suggested. One of our e...

متن کامل

Proof-Like Counter-Examples

Counter-examples explain why a desired temporal logic property fails to hold, and as such considered to be the most useful form of output from modelcheckers. Reported explanations are typically short and described in terms of states and transitions of the model; as a result, they can be effectively used for debugging. However, counter-examples are not available for every CTL property and are of...

متن کامل

Counter Examples to the Conjecture on the Complexity of BDD Binary Operations

(Abstract) In this article, we disprove the long-standing conjecture, proposed by R. E. Bryant in 1986, that any binary operation on two Boolean functions can be performed by his BDD algorithm in input-output linear time. We present Boolean functions for which his algorithm requires quadratic time in the input-output size for any non-trivial binary operation such as ∧, ∨, and ⊕. For the operati...

متن کامل

Stable bundles on hypersurfaces as counter-examples to a conjecture of Douglas, Reinbacher and Yau

We provide counter-examples to a conjecture posed by Douglas, Reinbacher and Yau on the Chern classes of stable holomorphic bundles on Kähler manifolds. 2000 MSC: 14J60; 14F05

متن کامل

Finding Counter Examples in Induction Proofs

This paper addresses a problem arising in automated proof of invariants of transition systems, for example transition systems modelling distributed programs. Most of the time, the actual properties we want to prove are too weak to hold inductively, and auxiliary invariants need to be introduced. The problem is how to find these extra invariants. We propose a method where we find minimal counter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of Mathematical Sciences and Applications

سال: 2015

ISSN: 2278-9634

DOI: 10.18052/www.scipress.com/bmsa.12.39